Counter machines, Petri Nets, and consensual computation
نویسندگان
چکیده
منابع مشابه
Petri Nets, Counter Machines and parallel matching computations
For the classical family of languages recognized by Place-Transitions Petri Nets (or, equivalently, by Greibach’s quasirealtime partially blind counter machines), we propose a new implementation by means of matching finite-state computations, within the model of consensually regular languages (introduced by the authors). A Petri Net computation is mapped on multiple finite-states computations t...
متن کاملRevisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
متن کاملComputation of Invariants for Algebraic Petri Nets
Abstract In the first part of this article we discuss the definition of Pand T–invariants for algebraic Petri nets. Thereby we stress the strong relation of these concepts with those for colored Petri nets. This part contains furthermore a comparison with the concepts defined in [Rei91], where first algebraic nets, invariant concepts and the main theorems concerning invariants have been present...
متن کاملEfficient Computation by Three Counter Machines
We show that multiplication can be done in polynomial time on a three counter machine that receives its input as the contents of two counters. The technique is generalized to functions of two variables computable by deterministic Turing machines in linear space.
متن کاملReversible Computation vs. Reversibility in Petri Nets
Petri nets are a general formal model of concurrent systems which supports both action-based and state-based modelling and reasoning. One of important behavioural properties investigated in the context of Petri nets has been reversibility, understood as the possibility of returning to the initial marking from any reachable net marking. Thus reversibility in Petri nets is a global property. Reve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.12.004